A Scheduling Algorithm for Reducing Unused Timeslots by Considering Head Gap and Tail Gap in Time Sliced Optical Burst Switched Networks
نویسندگان
چکیده
We propose a scheduling algorithm for reducing unused timeslots by considering head gap and tail gap newly generated by assigning a data burst in order to improve the burst loss probability and the throughput performances in Time Sliced Optical Burst Switched (TSOBS) networks. The proposed scheduling algorithm selects the timeslot in which either head gap or tail gap newly generated becomes the minimum. We show that the proposed scheduling algorithm can improve the burst loss probability and the throughput performances as compared with the
منابع مشابه
A scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network
We propose a scheduling algorithm minimizing voids generated by arriving bursts in optical burst switched WDM network. In the proposed scheduling algorithm, when the burst which has arrived at optical core router at a certain time can be transmitted in some data channels by using the unused data channel capacity(it is called void), our proposed scheduling algorithm selects the data channel in w...
متن کاملMaximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm
The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important...
متن کاملGeneralized burst assembly and scheduling techniques for QoS support in optical burst-switched networks
In this paper, we address the issue of providing differentiated services to IP packets over an optical burst switched core network, and we introduce a new approach for assembling packets into a burst. In this technique, a composite burst is created by combining packets of different classes into the same burst. The packets are placed from the head of the burst to the tail of the burst in order o...
متن کاملA Composite Scheduling Approach for Burst Loss Minimization in Optical Burst Switched Networks
In optical burst switched (OBS) networks, burst scheduling is one of the key issue, which affects the performance of networks. Several, scheduling algorithms have been used, such as horizon and void filling based algorithms. Void filling algorithms reduces burst loss, but it has more execution time as compared to horizon algorithms. On the other hand, horizon algorithms has less execution time,...
متن کاملTwo phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004